Bounded Tree-Width and CSP-Related Problems
نویسندگان
چکیده
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B, when each element in A is only allowed a certain subset of elements of B as its image. We prove, under a certain complexity-theoretic assumption, that this list homomorphism problem is solvable in polynomial time if and only if all structures in C have bounded tree-width. The result is extended to the connected list homomorphism, edge list homomorphism, minimum cost homomorphism, and maximum solution problems. We also show an inapproximability result for the minimum cost homomorphism problem.
منابع مشابه
Tabu Search for Generalized Hypertree Decompositions
Many important real world problems can be formulated as Constraint Satisfaction Problems (CSPs). A CSP consists of a set of variables each with a domain of possible values, and a set of constraints on the allowed values for specified subsets of variables. A solution to CSP is the assignment of values to variables, such that no constraint is violated. CSPs include many NP-complete problems and a...
متن کاملA Tractable hypergraph properties for constraint satisfaction and conjunctive queries
An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (i.e., where each constraint involves only two variables), the situation is well understood: the complexity of the problem essentially depends on the tree...
متن کاملTree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance is decomposed into a number of sub-problems, called views, whose solutions are either already available or can be computed efficiently. The goal is to arrange portions of these views in a tree-like structure, called tr...
متن کاملAlgorithmic Applications of Tree-Cut Width
The recently introduced graph parameter tree-cut width plays a similar role with respect to immersions as the graph parameter treewidth plays with respect to minors. In this paper we provide the first algorithmic applications of tree-cut width to hard combinatorial problems. Tree-cut width is known to be lower-bounded by a function of treewidth, but it can be much larger and hence has the poten...
متن کاملBounded Width Problems and Algebras
Let A be finite relational structure of finite type, and let CSP (A) denote the following decision problem: if I is a given structure of the same type as A, is there a homomorphism from I to A ? To each relational structure A is associated naturally an algebra A whose structure determines the complexity of the associated decision problem. We investigate those finite algebras arising from CSP’s ...
متن کامل